Enhancing answer set programming with templates
نویسندگان
چکیده
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures: we show how ASP can be extended with ‘template’ predicate’s definitions. We present language syntax and give its operational semantics. We show that the theory supporting our ASP extension is sound, and that program encodings are evaluated as efficiently as ASP programs. Examples show how the extended language increases declarativity, readability, compactness of program encodings and code reusability..
منابع مشابه
Conflict-Driven Constraint Answer Set Solving with Lazy Nogood Generation
We present a new approach to enhancing answer set programming (ASP) with constraint programming (CP) techniques based on conflict-driven learning and lazy nogood generation.
متن کاملAnswer Set Programming with Templates
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures. We show how ASP can be extended with ‘template’ predicate’s definitions by introducing a wellsuited form of second order logics. We present language syntax and give its operational semantics. We show that the theory supporting o...
متن کاملAnswer-Set Programming Based Dynamic User Modeling for Recommender Systems
In this paper we propose the introduction of dynamic logic programming – an extension of answer set programming – in recommender systems, as a means for users to specify and update their models, with the purpose of enhancing recommendations.
متن کاملERASP - a system for enhancing recommendations using answer-set programming
User modelling and personalisation are the key aspects of recommender systems in terms of recommendation quality. While being very efficient and designed to work with huge amounts of data, present recommender systems often lack the facility of user integration when it comes to feedback and direct user modelling. We propose the introduction of dynamic logic programming – an extension of answer s...
متن کاملDisjunctive answer set solvers via templates
Answer set programming is a declarative programming paradigm oriented towards difficult combinatorial search problems. A fundamental task in answer set programming is to compute stable models, i.e., solutions of logic programs. Answer set solvers are the programs that perform this task. The problem of deciding whether a disjunctive program has a stable model is Σ2 -complete. The high complexity...
متن کامل